Submonoids and rational subsets of groups with infinitely many ends

نویسندگان

  • Markus Lohrey
  • Benjamin Steinberg
چکیده

In this paper we show that the membership problems for finitely generated submonoids and for rational subsets are recursively equivalent for groups with two or more ends.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ar X iv : 0 90 7 . 07 87 v 1 [ m at h . G R ] 4 J ul 2 00 9 Submonoids and rational subsets of groups with infinitely many ends

In this paper we show that the membership problems for finitely generated submonoids and for rational subsets are recursively equivalent for groups with two or more ends.

متن کامل

The Rational Subset Membership Problem for Groups: A Survey

The class of rational subsets of a group G is the smallest class that contains all finite subsets of G and that is closed with respect to union, product and taking the monoid generated by a set. The rational subset membership problem for a finitely generated group G is the decision problem, where for a given rational subset of G and a group element g it is asked whether g ∈ G. This paper presen...

متن کامل

Rational Subsets and Submonoids of Wreath Products

It is shown that membership in rational subsets of wreath products H ≀ V with H a finite group and V a virtually free group is decidable. On the other hand, it is shown that there exists a fixed finitely generated submonoid in the wreath product Z ≀ Z with an undecidable membership problem.

متن کامل

ar X iv : 1 30 2 . 24 55 v 1 [ m at h . G R ] 1 1 Fe b 20 13 Rational subsets and submonoids of wreath products ⋆

It is shown that membership in rational subsets of wreath products H ≀ V with H a finite group and V a virtually free group is decidable. On the other hand, it is shown that there exists a fixed finitely generated submonoid in the wreath product Z ≀ Z with an undecidable membership problem.

متن کامل

On the Diophantine Equation x^6+ky^3=z^6+kw^3

Given the positive integers m,n, solving the well known symmetric Diophantine equation xm+kyn=zm+kwn, where k is a rational number, is a challenge. By computer calculations, we show that for all integers k from 1 to 500, the Diophantine equation x6+ky3=z6+kw3 has infinitely many nontrivial (y≠w) rational solutions. Clearly, the same result holds for positive integers k whose cube-free part is n...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009